Instruction for implementing iterations having an iteration dependent condition with a vector loop

ABSTRACT

A processor is described having an instruction execution pipeline. The instruction execution pipeline includes an instruction fetch stage to fetch an instruction. The instruction identifies an input vector operand whose input elements specify one or the other of two states. The instruction execution pipeline also includes an instruction decoder to decode the instruction. The instruction execution pipeline also includes a functional unit to execute the instruction and provide a resultant output vector. The functional unit includes logic circuitry to produce an element in a specific element position of the resultant output vector by performing an operation on a value derived from a base value using a stride in response to one but not the other of the two states being present in a corresponding element position of the input vector operand.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present patent application is a continuation application claiming priority from U.S. patent application Ser. No. 14/327,527, filed Jul. 9, 2014 and titled: “Instruction for Implementing Iterations Having an Iteration Dependent condition with a Vector Loop”, which is incorporated herein by reference in its entirety.

FIELD OF INVENTION

The field of invention pertains to the computing sciences, and, more specifically, to an instruction for implementing iterations having an iteration dependent condition with a vector loop.

BACKGROUND

FIG. 1 shows a high level diagram of a processing core 100 implemented with logic circuitry on a semiconductor chip. The processing core includes a pipeline 101. The pipeline consists of multiple stages each designed to perform a specific step in the multi-step process needed to fully execute a program code instruction. These typically include at least: 1) instruction fetch and decode; 2) data fetch; 3) execution; 4) write-back. The execution stage performs a specific operation identified by an instruction that was fetched and decoded in prior stage(s) (e.g., in step 1) above) upon data identified by the same instruction and fetched in another prior stage (e.g., step 2) above). The data that is operated upon is typically fetched from (general purpose) register storage space 102. New data that is created at the completion of the operation is also typically “written back” to register storage space (e.g., at stage 4) above).

The logic circuitry associated with the execution stage is typically composed of multiple “execution units” or “functional units” 103_1 to 103_N that are each designed to perform its own unique subset of operations (e.g., a first functional unit performs integer math operations, a second functional unit performs floating point instructions, a third functional unit performs load/store operations from/to cache/memory, etc.). The collection of all operations performed by all the functional units corresponds to the “instruction set” supported by the processing core 100.

Two types of processor architectures are widely recognized in the field of computer science: “scalar” and “vector”. A scalar processor is designed to execute instructions that perform operations on a single set of data, whereas, a vector processor is designed to execute instructions that perform operations on multiple sets of data. FIGS. 2A and 2B present a comparative example that demonstrates the basic difference between a scalar processor and a vector processor.

FIG. 2a shows an example of a scalar AND instruction in which a single operand set, A and B, are ANDed together to produce a singular (or “scalar”) result C (i.e., AB=C). By contrast, FIG. 2b shows an example of a vector AND instruction in which two operand sets, A/B and D/E, are respectively ANDed together in parallel to simultaneously produce a vector result C, F (i.e., A.AND.B=C and D.AND.E=F). As a matter of terminology, a “vector” is a data element having multiple “elements”. For example, a vector V =Q, R, S, T, U has five different elements: Q, R, S, T and U. The “size” of the exemplary vector V is five (because it has five elements).

FIG. 1 also shows the presence of vector register space 107 that is different than general purpose register space 102. Specifically, general purpose register space 102 is nominally used to store scalar values. As such, when any of the execution units perform scalar operations they nominally use operands called from (and write results back to) general purpose register storage space 102. By contrast, when any of the execution units perform vector operations they nominally use operands called from (and write results back to) vector register space 107. Different regions of memory may likewise be allocated for the storage of scalar values and vector values.

FIGURES

A better understanding of the present invention can be obtained from the following detailed description in conjunction with the following drawings, in which:

FIG. 1 shows an instruction execution pipeline;

FIGS. 2a and 2b compare scalar vs. vector processing;

FIG. 3 shows an iterative process that determines the state of a condition within each iteration;

FIG. 4 shows a diagram of an improved instruction sequence that uses a conditional increment instruction to implement an iterative process that determines a state of a condition within each iteration within a vector loop;

FIG. 5a shows a first embodiment of a logic circuit for a functional unit that performs a conditional increment instruction;

FIG. 5b shows a second embodiment of a logic circuit for a functional unit that performs a conditional increment instruction;

FIG. 6a is a block diagram illustrating a generic vector friendly instruction format and class A instruction templates thereof according to embodiments of the invention.

FIG. 6b is a block diagram illustrating the generic vector friendly instruction format and class B instruction templates thereof according to embodiments of the invention.

FIGS. 7a-d are block diagrams illustrating an exemplary specific vector friendly instruction format according to embodiments of the invention.

FIG. 8 is a block diagram of a register architecture according to one embodiment of the invention.

FIG. 9a is a block diagram of a single CPU core, along with its connection to the on-die interconnect network and with its local subset of the level 2 (L2) cache, according to embodiments of the invention.

FIG. 9b is an exploded view of part of the CPU core in FIG. 9A according to embodiments of the invention.

FIG. 10a is a block diagram illustrating an exemplary out-of-order architecture according to embodiments of the invention.

FIG. 10b is a block diagram illustrating an exemplary out-of-order architecture according to embodiments of the invention.

FIG. 11 is a block diagram of a system in accordance with one embodiment of the invention.

FIG. 12 is a block diagram of a second system in accordance with an embodiment of the invention.

FIG. 13 is a block diagram of a third system in accordance with an embodiment of the invention.

FIG. 14 is a block diagram of a SoC in accordance with an embodiment of the invention.

FIG. 15 is a block diagram of a single core processor and a multicore processor with integrated memory controller and graphics according to embodiments of the invention.

FIG. 16 is a block diagram contrasting the use of a software instruction converter to convert binary instructions in a source instruction set to binary instructions in a target instruction set according to embodiments of the invention.

DETAILED DESCRIPTION

Iterative processes can frequently be “sped up” or otherwise made more efficient through the implementation of a vector loop. In order to implement a vector loop one or more vectors are created where elements in the vectors represent different iteration cycles. For example, a first element in a vector represents a first iteration, a second element in the vector represents a second iteration, etc. By performing vector operations on these vectors multiple iterations can be effectively performed in parallel (e.g., simultaneously).

Iterative processes of the form depicted in FIG. 3, however, are currently not able to be compiled into a vector loop. The iterative form depicted in FIG. 3 tends to be found in various applications such as molecular dynamic codes or numerical weather simulation.

FIG. 3 shows an iterative process controlled by a variable “i”. That is, i increments (or decrements) 301 with each iteration. After N iterations 306 the process stops 307. As part of each iteration an inquiry is made into whether a condition is “true” or “not true” 302. The condition can be true or not true as a function of i. That is, the condition may be true for one iteration yet not be true for another iteration. The set of circumstances and/or processes that determine whether the condition is true or not for any iteration (value of i) can be practically unlimited.

An iteration whose condition is true will behave differently than an iteration whose condition is not true. If the condition is true a variable n is incremented by a stride value s 303. Here, s can be any value and n can have any initial value. For example, if s=1 and the initial value of n is 0, n will increment according to the pattern 0, 1, 2, 3, . . . each time the condition is true. By contrast, if s=3 and the initial value of n is 0, n will increment according to the pattern 0, 3, 6, 9, . . . each time the condition is true.

Again, the condition may be true for various values of i. For example, the condition may be true for the first iteration and then not be true again until the tenth iteration. Thus n will remain constant for the second through ninth iterations. Thus n provides some reflection of how many times the condition has been true over the course of the iterations. As alluded to above, the variable of n is also typically provided with an initial value (e.g., n=0) before the start of the iterative sequence.

Regardless if the condition is true or not, each iteration will determine a variable x based on n 304. Specifically, there is understood to be an array A (e.g., a large vector A) and x assumes the value of a location in A based on n (x=A[n]). Thus, for each iteration, n acts as an index into A that determines a value of x. If the condition is not true for a particular iteration, x will assume the same value that it did as the previous iteration (because if the condition is not true, n did not increment to another, new index value into A).

With x being determined, the computation for the result of the iteration is finally performed 305. That is, the result is a function of x. In other cases the result computation may, along with x, also be a function of i (the iteration count) and/or the value of n (the measurement of the number of true conditions over the iterations). Here, as with the condition, the result computation 305 may be implemented with any of a practically unlimited number of computational processes. When all of the iterations have executed, the result is N computation results.

Unfortunately, because of the complexity of the iterative process, particularly the inquiry into the condition 302, the increment of n by s if the condition is true 303 and the use of n as an index into A, compilers have difficulty compiling processes of the form of FIG. 3 into a vector loop. Thus the present application describes a new instruction that permits compilers to more easily compile the iterative process of FIG. 3 into a vector loop.

FIG. 4 shows an embodiment of a program code structure and flow that utilizes the new instruction to implement the iterative process of FIG. 3 with a vector loop.

As observed in FIG. 4 the program code creates a vector, referred to as the “loop vector” (LV), whose elements represent progression through the iterations 401. In an embodiment, a neighboring element location represents a “next” iteration relative to the element location that it neighbors, and, the values of the loop vector's elements correspond to a “loop count”. For example, in an embodiment in which the loop vector is implemented as an eight element vector, the loop vector could be instantiated with the following content to represent the first eight iterations of the iterative process:

LV<=7 6 5 4 3 2 1 0   1.

Over the course of the iterations, the loop vector would be updated between the eighth and ninth iterations to represent the ninth through sixteenth iteration as follows:

LV<=15 14 13 12 11 10 9 8   2.

The contents of LV can therefore be viewed, at least is some implementations, as the value of i over the course of the iterations in sequence.

The program code also creates a second vector, the “conditional vector” (CV), whose elements indicate whether the condition is true (or not true) on any particular iteration 402. Like the loop vector LV, in an embodiment, a neighboring element location within the conditional vector (CV) represents a “next” iteration relative to the element location that it neighbors.

However, unlike the loop vector LV, the elements of the CV indicate whether the condition of its respective iteration is true or not. For example, in an embodiment in which a true is represented with a 1 and not true is represented with a 0, in a process where the condition is true for the fourth and seventh iterations but no other iterations within the first eight iterations, the conditional vector may take the following form:

CV<=0 1 0 0 1 0 0 0   3.

Over course of the iterations, the conditional vector would be updated between the eighth and ninth iterations to reflect the conditions over the course of the ensuing ninth through sixteenth iterations. For example, if the condition is true for the tenth and twelfth iterations but no other iterations within the ninth through sixteenth iterations, the updated conditional vector would take the following form:

CV<=0 0 0 0 1 0 1 0   4.

The new instruction alluded to above (CONDINC) is executed 403 after the conditional vector is created 402. The CONDINC instruction accepts the conditional vector as an input operand and returns as a resultant a third vector, referred to as the “n vector” (NV), whose content represents the value of n over the course of the iterations.

In an embodiment, like the loop vector LV and conditional vector CV, a neighboring element location within the n vector NV represents a “next” iteration relative to the element location that it neighbors. However, unlike either of the loop vector LV or conditional vector CV, the n vector NV demonstrates the increment of n by the stride s each time the condition is true across the iterations. For example if the conditional vector CV specified above in Eqn. 3 applies across the first eight iterations, the CONDINC instruction would provide the following resultant for an initial value of n of 0, a stride s of 3 and an input vector operand CV as specified in Eqn. 4:

NV<=6 6 3 3 3 0 0 0   5.

Continuing with the example, if the conditional vector CV of Eqn. 4 applies for the ninth through sixteenth iterations, the CONDINC instruction would provide the following resultant:

NV<=12 12 12 12 12 9 9 6   6.

Note that the value of n from the eighth iteration (leftmost value of NV of Eqn. 5=6) carries over to the value of n for the ninth iteration (rightmost value of NV of Eqn. 6=6). As will be described in more detail below, the “carry over” of a value of n from an immediately preceding iteration as determined from an immediately preceding execution of the CONDINC instruction can be accepted as an input operand for the CONDINC instruction.

Subsequent to the execution of the CONDINC instruction, one or more instructions (e.g., vector instructions) are executed 404 to determine a fourth vector, referred to as the “x vector” (XV) which establishes the values of x across the progression of iterations. Recalling that n acts as an index into the array A, the one or more instructions 404 essentially return in vector format the values of A corresponding to index locations provided by the n vector (NV). For example, if the first eight values of A are as provided below:

A[7:0]=128 64 32 16 8 4 2 1   7

and if the n vector NV of Eqn. 5 is taken by instruction processing 404 as the corresponding vector input operand, the corresponding x vector XV produced by instruction processing 404 will be as follows:

XV<=64 64 8 8 8 1 1 1   8.

The one or more instructions utilized in performing process 404 may include, for instance, a gather instruction. A gather instruction is an instruction that extracts elements from an array based on input index values.

With the creation of the loop vector LV in Eqn. 1, the n vector NV in Eqn. 5 and the x vector XV in Eqn. 8, the input variables for the first eight iterations of the process of FIG. 3 are set up in vector form. These equations are repeated below for convenience.

LV<=7 6 5 4 3 2 1 0   1.

NV<=6 6 3 3 3 0 0 0   5.

XV<=64 64 8 8 8 1 1 1   8.

Here, a same positioned set of elements across the three vectors above correspond to the correct i, n and x values for the particular iteration that they represent. That is, for example, the rightmost (first) element position across the LV, NV and XV vectors correspond to the correct set of i, n and x values for the first iteration of the process of FIG. 3 (i=0, n=0 and x=1), the fourth element position across the LV, NV and XV vectors correspond to the correct set of i, n and x values for the fourth iteration of the process of FIG. 3 (i=3, n=3, x=8), etc.

As such, with the creation of these vectors, the instruction sequence is finally prepared to perform the resultant computation 405 as a vector operation if desired. Again, the resultant computation 405 can practically be any of an unlimited number of different computations. Ultimately, however, in an embodiment, the result of result computation 405 will be result(i) in vector format for the first eight iterations. That is, if the syntax RS(i) is used to specify “result(i)” (i.e., the result of the ith iteration), the resultant from the processing performed by block 405 will be the result vector RV as follows:

RV<=RS(7) RS(6) RS(5) RS(4) RS(3) RS(2) RS(1) RS(0)   9.

After RV is computed as provided just above for the first eight iterations of the process of FIG. 3, a next vector loop of the instruction sequence of FIG. 4 can be performed that will produce Eqn. 2 for the i values and Eqn. 6 for the n values. Using the n vector of FIG. 4 as the input for the next computation of process 404 for the second loop will generate a corresponding x vector XV for the eighth through sixteenth iterations. This will produce another set of LV, NV and XV vectors for the result computation 405 of the second vector loop. The loop vectors of FIG. 4 then repeat as described above until the number of desired iterations is complete.

Although the above example was described in reference to vector sizes of eight elements, it should be understood that the same process described above can readily be extended to other vector sizes (e.g., vector sizes of 16, 32, 64, 128, 256, 512, etc.).

The above discussion also considered as a main embodiment the adding of a stride. That is, n=n+s. In one embodiment, a vector processor that supports the new CONDINC instruction supports a general form of the instruction: CONDINCOP. Here, the CONDINCOP instruction (“conditional increment operation”) corresponds to essentially the same instructional process as in the preceding example above, but with an update of n by any type of reduction operation, e.g. n=n OP s, where OP is one of arithmetical operations (+, −, *, /), bit manipulation operation (<<, >>, etc), logical operation (or, and, nor, xor, etc.). The type of operation may be encoded as an additional immediate input operand, or may be encoded in the opcode of operation. For example, CONDINCOP k1, zmmsrc1, zmmsrc2, zmmdest, op

 n=zmmsrc1[KL−1]; //n = base value  for(i=0; i<KL; i++){   if(k1[i]==1) n=n op zmmsrc2[i];   zmmdest[i] = n; }

Here k1 is a conditional vector (CV), zmmsrc1 provides a base value as one of the elements of the vector or as a scalar (as will be described hereafter), zmmsrc2 provides a second operand for the update operation of the n value, zmmdest is a resulting NV vector.

In alternative or even further combined embodiments, two other forms of the CONDINC instruction are provided for iterative processes that deviate from the form of FIG. 3 into a “post increment” form. That is, FIG. 3 shows a process where, for the ith iteration, n is incremented before the resultant computation 305 if the condition for the ith iteration is true.

By contrast, an alternative form of iterative process may exist in which, for the ith iteration, n is incremented after the resultant computation 305 if the condition for the ith iteration is true. This type of process can easily be envisioned by moving blocks 304 and 305 ahead of blocks 302 and 303 in FIG. 3, and, blocks 404 and 405 ahead of blocks 402 and 403 in FIG. 4. In this case, each iteration i ends with an increment of n or no increment of n depending on the condition for i. This has the effect of causing the next iteration i+1 to use a value n that is incremented by the stride s as compared to the value n used for iteration i (if iteration i indexes into array A with an index of n and the condition for the ith iteration is true, then iteration i+1 will index into array A with an index of n+s).

According to this post increment approach, in order to produce the correct values of n for the ith iteration, another instruction CONDINCPOST will show an increment of n in the i+1 element of the n vector resultant NV rather than the ith element (as is done with the CONDINC instruction). For example, recall that for a condition vector CV input operand of

CV<=0 1 0 0 1 0 0 0   3.

The CONDINC instruction produced an NV resultant of

NV<=6 6 3 3 3 0 0 0   5.

By contrast, if the CONDINCPOST instruction received the same CV input vector as provided in Eqn. 3 above (and with an initial value of n=0 and with a stride of 3), the NV resultant would be:

NV<=6 3 3 3 0 0 0 0   10.

In an embodiment of the CONDINCPOST instruction, if the last (highest) element of the CV input vector indicates the condition is true, the instruction is designed to set a carry term into control register space so that the immediately following CONDINCPOST instruction will know to increment its first (lowest) output NV vector element. In further embodiments, there is also a generalized version of CONDINCPOST: CONDINCPOSTOP. As with CONDINCOP, CONDINCPOSTOP regards the operation type as encoded input operand and updates n by performing this operation with each true condition (n=n OP s) but with the post increment function.

A compiler therefore can recognize the existence of either the normal format of FIG. 3 or the post increment format described above and insert a CONDINC instruction into the instruction stream consistent with the principles described above. Note that some forms of the iterative process of FIG. 3 (or the corresponding post increment process) may not use i and/or n as explicit input values for the result computation 305 (the result computation still uses x as an input value). Alternatively, the iterative process of FIG. 3 may not use n as an index for accessing array values 304, and the resultant computation may not depend of x. Moreover, n may be not an integer value, but any floating point value, updated by floating point operation with a floating point stride and base values.

Any form of any of the instructions discussed above may not even include the base and/or the stride as input operands (e.g., an instruction that has hardcoded in its operation a base value of 0 and a stride of 1).

FIG. 5a shows an embodiment of a core logic circuit for a functional unit that is designed to perform a CONDINC instruction. According to the particular design of FIG. 5 a, the singular core logic circuit is instantiated only once within the functional unit such that the different elements of the resultant vector are each individually processed by the single circuit. According to this approach, the output vector of the instruction is formed by way of the functional unit controlling its own sequence of internal loops that iterate through the circuit (once per output vector elements). Other more parallelized approaches are also possible which are described in more detail with respect to FIG. 5 b.

As observed in FIG. 5 a, the functional unit includes a first multiplexer 501, which feeds its result into an ALU 503, and through a bypass into a second multiplexer 502. The result of ALU 503 also feeds into the second multiplexer 502. The first multiplexer 501 provides a “base” value as a second operand of the ALU 503 and as a second operand of the second multiplexer 501 if the first (lowest ordered) element of the resultant vector is being processed. Thus, the base value corresponds to the initial value of n if the instruction is processing the first sequence of iterations, otherwise, the base value corresponds to the carried over n value from the immediately prior CONDINC instruction that was executed. Once the first resultant element is processed, the output is stored and provided back to the ALU 503 through the first multiplexer 501.

A first operand of the ALU 503 is provided with stride s. ALU 503 performs an increment operation on the first and the second operands and provides the result as a first operand of the second multiplexer 502.

The second multiplexer 502 returns result of the ALU 503 as a final result if the vector element position being processed has a conditional vector CV element value of 1. Otherwise, the second multiplexer 502 returns the second operand of the ALU 503 as a final result, which is bypassed to the second operand of the second multiplexer 502. By so doing, in calculating the n value for the resultant vector element position currently being processed, multiplexer 502 causes an increment by s of the immediately prior n value if the corresponding element has a true condition, or, keeps the immediately prior n value if the corresponding element is not true. Here, the functional unit accepts a conditional vector CV as an input operand and a next element in the CV input operand is provided to multiplexer 502 in succession with each internal loop of the functional unit that processes a next resultant vector element position.

The base value and the stride s can each be accepted as a scalar, or, a vector of repeating base values and a vector of stride values respectively as additional vector operands. For example, if the functional unit provides an eight element vector as the resultant and the stride value is 3, the stride input vector may be created as 3 3 3 3 3 3 3 3. In this case, the functional unit takes each stride value from each next element in succession as is done with the conditional vector input operand. Likewise, the base value input vector may be crafted as b b b b b b b b. Here, however, only one of the elements is accepted as an input operand value and processed (for the processing of the first element in the resultant). Alternatively, base and stride values may be provided as immediate scalar operands within the instruction format or may be passed as scalars within a vector input operand format (e.g., “X X X XX XX s” for the input vector operand that provides the stride value). For iterations other than the very first sequence of iterations, as alluded to previously, the base value be may provided from control vector register space that holds the b value as a carry term provided from the immediately prior executed CONDINC instruction).

The above discussion with respect to FIG. 5a was directed to the implementation of a CONDINC instruction that processed each element in the vector resultant in serial fashion. The same circuit and approach as described above can also be used to implement a CONDINCOP instruction as the ALU 503 may perform not only addition but any other operation.

A CONDINCPOST instruction can be implemented (any type of operation by taking appropriate ALU 503) by providing the value from the i-1th element of the conditional vector input operand to the channel select input of the second multiplexer 502 during processing of the ith iteration. For example, if the i=4 resultant vector element is currently being processed, the channel select input of multiplexer 502 receives the value from the i−1=3 element position of the conditional vector. For the very first iteration (i=0) condition is assumed to be false to bypass the ALU 503.

FIG. 5b shows a core logic circuit for a parallelized implementation of the CONDINC instruction. The core circuitry of the parallelized circuit is similar to the circuit of FIG. 5a except that the resultant outputs are chained over to an input of the ALU and an input of the second multiplexer of the next element position. If there is one core circuit per resultant output vector element, the core circuit for the first element position does not need a first multiplexer (the base value is propagated directly to its ALU). If there are less core circuits than output vector elements (e.g., there are four core circuits and eight output vector elements such that two functional unit cycles are sufficient to process the entire resultant (a first cycle produces output elements 0-3 and a second cycle produces output elements 4-7)), the first core circuit can include a first multiplexer and receive the output from the farthest resultant on the other side of the block of core circuits (to ripple the latest value of n forward in the chain). The circuit can receive multiple elements from the conditional vector input operand in parallel and process them in an aligned fashion as depicted in FIG. 5 b.

The above discussion with respect to FIG. 5b was directed to the implementation of a CONDINC instruction that can potentially process multiple elements of the vector resultant simultaneously. The same circuit and approach as described above in FIG. 5b can also be used to implement a CONDINCOP instruction with any type of increment operation by taking an appropriate ALU block.

A CONDINCPOSTOP instruction can be implemented (with any type of increment operation specified by the ALU used) by providing the i−1th value from the conditional vector input operand to the channel select input of the second multiplexer to the core circuit that processes the ith element of the resultant vector. For example, the core circuit that processes the i=4 resultant vector element receives the content of the i−1=3 element position of the conditional vector. For the very first iteration (i=0) condition is assumed to be false to bypass the ALU 503.

In any/all of the embodiments above, the conditional vector is provided from mask register space (thus created conditional vectors are stored in mask vector register space) even though the conditional vector is not handled as a traditional write-mask. In various embodiments the stride is specified as an input operand (e.g., an immediate operand). Although in some embodiments the stride may be assumed to be equal to 1 (or other predefined value), which may save an additional input operand. In the same manner the base element may be assumed to be equal to 0 (or other predefined value) and save another input operand.

Embodiments of the instruction(s) detailed above may be at least partially embodied in a “generic vector friendly instruction format” which is detailed below. Additionally, exemplary systems, architectures, and pipelines are detailed below. Embodiments of the instruction(s) above may be executed on such systems, architectures, and pipelines, but are not limited to those detailed.

A vector friendly instruction format is an instruction format that is suited for vector instructions (e.g., there are certain fields specific to vector operations). While embodiments are described in which both vector and scalar operations are supported through the vector friendly instruction format, alternative embodiments use only vector operations the vector friendly instruction format.

Exemplary Generic Vector Friendly Instruction Format—FIG. 6A-B

FIGS. 6a-b are block diagrams illustrating a generic vector friendly instruction format and instruction templates thereof according to embodiments of the invention. FIG. 6a is a block diagram illustrating a generic vector friendly instruction format and class A instruction templates thereof according to embodiments of the invention; while FIG. 6b is a block diagram illustrating the generic vector friendly instruction format and class B instruction templates thereof according to embodiments of the invention. Specifically, a generic vector friendly instruction format 600 for which are defined class A and class B instruction templates, both of which include no memory access 605 instruction templates and memory access 620 instruction templates. The term generic in the context of the vector friendly instruction format refers to the instruction format not being tied to any specific instruction set. While embodiments will be described in which instructions in the vector friendly instruction format operate on vectors that are sourced from either registers (no memory access 605 instruction templates) or registers/memory (memory access 620 instruction templates), alternative embodiments of the invention may support only one of these. Also, while embodiments of the invention will be described in which there are load and store instructions in the vector instruction format, alternative embodiments instead or additionally have instructions in a different instruction format that move vectors into and out of registers (e.g., from memory into registers, from registers into memory, between registers). Further, while embodiments of the invention will be described that support two classes of instruction templates, alternative embodiments may support only one of these or more than two.

While embodiments of the invention will be described in which the vector friendly instruction format supports the following: a 64 byte vector operand length (or size) with 32 bit (4 byte) or 64 bit (8 byte) data element widths (or sizes) (and thus, a 64 byte vector consists of either 16 double word-size elements or alternatively, 8 quadword-size elements); a 64 byte vector operand length (or size) with 16 bit (2 byte) or 8 bit (1 byte) data element widths (or sizes); a 32 byte vector operand length (or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit (2 byte), or 8 bit (1 byte) data element widths (or sizes); and a 16 byte vector operand length (or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit (2 byte), or 8 bit (1 byte) data element widths (or sizes); alternative embodiments may support more, less and/or different vector operand sizes (e.g., 656 byte vector operands) with more, less, or different data element widths (e.g., 128 bit (16 byte) data element widths).

The class A instruction templates in FIG. 6A include: 1) within the no memory access 605 instruction templates there is shown a no memory access, full round control type operation 610 instruction template and a no memory access, data transform type operation 615 instruction template; and 2) within the memory access 620 instruction templates there is shown a memory access, temporal 625 instruction template and a memory access, non-temporal 630 instruction template. The class B instruction templates in FIG. 6B include: 1) within the no memory access 605 instruction templates there is shown a no memory access, write mask control, partial round control type operation 612 instruction template and a no memory access, write mask control, vsize type operation 617 instruction template; and 2) within the memory access 620 instruction templates there is shown a memory access, write mask control 627 instruction template. Format

The generic vector friendly instruction format 600 includes the following fields listed below in the order illustrated in FIGS. 6a -b. In conjunction with the discussions above concerning FIGS. 4, 5 a and 5 b, in an embodiment, referring to the format details provided below in FIGS. 6a-b and 7, either a non memory access instruction type 605 or a memory access instruction type 620 may be utilized. Addresses for the input vector operand(s) and destination may be identified in register address field 644 described below. The instructions may be formatted to be destructive or non destructive.

Format field 640—a specific value (an instruction format identifier value) in this field uniquely identifies the vector friendly instruction format, and thus occurrences of instructions in the vector friendly instruction format in instruction streams. Thus, the content of the format field 640 distinguish occurrences of instructions in the first instruction format from occurrences of instructions in other instruction formats, thereby allowing for the introduction of the vector friendly instruction format into an instruction set that has other instruction formats. As such, this field is optional in the sense that it is not needed for an instruction set that has only the generic vector friendly instruction format.

Base operation field 642—its content distinguishes different base operations. As described later herein, the base operation field 642 may include and/or be part of an opcode field.

Register index field 644—its content, directly or through address generation, specifies the locations of the source and destination operands, be they in registers or in memory. These include a sufficient number of bits to select N registers from a P×Q (e.g. 32×1012) register file. While in one embodiment N may be up to three sources and one destination register, alternative embodiments may support more or less sources and destination registers (e.g., may support up to two sources where one of these sources also acts as the destination, may support up to three sources where one of these sources also acts as the destination, may support up to two sources and one destination). While in one embodiment P=32, alternative embodiments may support more or less registers (e.g., 16). While in one embodiment Q=1012 bits, alternative embodiments may support more or less bits (e.g., 128, 1024).

Modifier field 646—its content distinguishes occurrences of instructions in the generic vector instruction format that specify memory access from those that do not; that is, between no memory access 605 instruction templates and memory access 620 instruction templates. Memory access operations read and/or write to the memory hierarchy (in some cases specifying the source and/or destination addresses using values in registers), while non-memory access operations do not (e.g., the source and destinations are registers). While in one embodiment this field also selects between three different ways to perform memory address calculations, alternative embodiments may support more, less, or different ways to perform memory address calculations.

Augmentation operation field 650—its content distinguishes which one of a variety of different operations to be performed in addition to the base operation. This field is context specific. In one embodiment of the invention, this field is divided into a class field 668, an alpha field 652, and a beta field 654. The augmentation operation field allows common groups of operations to be performed in a single instruction rather than 2, 3 or 4 instructions. Below are some examples of instructions (the nomenclature of which are described in more detail later herein) that use the augmentation field 650 to reduce the number of required instructions.

Instructions Sequences according Prior Instruction Sequences to on Embodiment of the Invention vaddps ymm0, ymm1, ymm2 vaddps zmm0, zmm1, zmm2 vpshufd ymm2, ymm2, 0x55 vaddps zmm0, zmm1, zmm2 {bbbb} vaddps ymm0, ymm1, ymm2 vpmovsxbd ymm2, [rax] vaddps zmm0, zmm1, [rax]{sint8} vcvtdq2ps ymm2, ymm2 vaddps ymm0, ymm1, ymm2 vpmovsxbd ymm3, [rax] vaddps zmm1{k5}, zmm2, vcvtdq2ps ymm3, ymm3 [rax]{sint8} vaddps ymm4, ymm2, ymm3 vblendvps ymm1, ymm5, ymm1, ymm4 vmaskmovps ymm1, ymm7, [rbx] vmovaps zmm1 {k7}, [rbx] vbroadcastss ymm0, [rax] vaddps zmm2{k7}{z}, zmm1, vaddps ymm2, ymm0, ymm1 [rax]{1toN} vblendvps ymm2, ymm2, ymm1, ymm7

Where [rax] is the base pointer to be used for address generation, and where { } indicates a conversion operation specified by the data manipulation filed (described in more detail later here).

Scale field 660—its content allows for the scaling of the index field's content for memory address generation (e.g., for address generation that uses 2^(scale)*index+base).

Displacement Field 662A—its content is used as part of memory address generation (e.g., for address generation that uses 2^(scale)*index+base+displacement).

Displacement Factor Field 662B (note that the juxtaposition of displacement field 662A directly over displacement factor field 662B indicates one or the other is used)—its content is used as part of address generation; it specifies a displacement factor that is to be scaled by the size of a memory access (N)—where N is the number of bytes in the memory access (e.g., for address generation that uses 2^(scale)*index+base+scaled displacement). Redundant low-order bits are ignored and hence, the displacement factor field's content is multiplied by the memory operands total size (N) in order to generate the final displacement to be used in calculating an effective address. The value of N is determined by the processor hardware at runtime based on the full opcode field 674 (described later herein) and the data manipulation field 654C as described later herein. The displacement field 662A and the displacement factor field 662B are optional in the sense that they are not used for the no memory access 605 instruction templates and/or different embodiments may implement only one or none of the two.

Data element width field 664—its content distinguishes which one of a number of data element widths is to be used (in some embodiments for all instructions; in other embodiments for only some of the instructions). This field is optional in the sense that it is not needed if only one data element width is supported and/or data element widths are supported using some aspect of the opcodes.

Write mask field 670—its content controls, on a per data element position basis, whether that data element position in the destination vector operand reflects the result of the base operation and augmentation operation. Class A instruction templates support merging-writemasking, while class B instruction templates support both merging- and zeroing-writemasking. When merging, vector masks allow any set of elements in the destination to be protected from updates during the execution of any operation (specified by the base operation and the augmentation operation); in other one embodiment, preserving the old value of each element of the destination where the corresponding mask bit has a 0. In contrast, when zeroing vector masks allow any set of elements in the destination to be zeroed during the execution of any operation (specified by the base operation and the augmentation operation); in one embodiment, an element of the destination is set to 0 when the corresponding mask bit has a 0 value. A subset of this functionality is the ability to control the vector length of the operation being performed (that is, the span of elements being modified, from the first to the last one); however, it is not necessary that the elements that are modified be consecutive. Thus, the write mask field 670 allows for partial vector operations, including loads, stores, arithmetic, logical, etc. Also, this masking can be used for fault suppression (i.e., by masking the destination's data element positions to prevent receipt of the result of any operation that may/will cause a fault—e.g., assume that a vector in memory crosses a page boundary and that the first page but not the second page would cause a page fault, the page fault can be ignored if all data element of the vector that lie on the first page are masked by the write mask). Further, write masks allow for “vectorizing loops” that contain certain types of conditional statements. While embodiments of the invention are described in which the write mask field's 670 content selects one of a number of write mask registers that contains the write mask to be used (and thus the write mask field's 670 content indirectly identifies that masking to be performed), alternative embodiments instead or additional allow the mask write field's 670 content to directly specify the masking to be performed. Further, zeroing allows for performance improvements when: 1) register renaming is used on instructions whose destination operand is not also a source (also call non-ternary instructions) because during the register renaming pipeline stage the destination is no longer an implicit source (no data elements from the current destination register need be copied to the renamed destination register or somehow carried along with the operation because any data element that is not the result of operation (any masked data element) will be zeroed); and 2) during the write back stage because zeros are being written.

Immediate field 672—its content allows for the specification of an immediate. This field is optional in the sense that is it not present in an implementation of the generic vector friendly format that does not support immediate and it is not present in instructions that do not use an immediate.

Instruction Template Class Selection

Class field 668—its content distinguishes between different classes of instructions. With reference to FIGS. 2a -b, the contents of this field select between class A and class B instructions. In FIGS. 6a -b, rounded corner squares are used to indicate a specific value is present in a field (e.g., class A 668A and class B 668B for the class field 668 respectively in FIGS. 6a-b ).

No-Memory Access Instruction Templates of Class A

In the case of the non-memory access 605 instruction templates of class A, the alpha field 652 is interpreted as an RS field 652A, whose content distinguishes which one of the different augmentation operation types are to be performed (e.g., round 652A.1 and data transform 652A.2 are respectively specified for the no memory access, round type operation 610 and the no memory access, data transform type operation 615 instruction templates), while the beta field 654 distinguishes which of the operations of the specified type is to be performed. In FIG. 6, rounded corner blocks are used to indicate a specific value is present (e.g., no memory access 646A in the modifier field 646; round 652A.1 and data transform 652A.2 for alpha field 652/rs field 652A). In the no memory access 605 instruction templates, the scale field 660, the displacement field 662A, and the displacement scale filed 662B are not present. No-Memory Access Instruction Templates—Full Round Control Type Operation

In the no memory access full round control type operation 610 instruction template, the beta field 654 is interpreted as a round control field 654A, whose content(s) provide static rounding. While in the described embodiments of the invention the round control field 654A includes a suppress all floating point exceptions (SAE) field 656 and a round operation control field 658, alternative embodiments may support may encode both these concepts into the same field or only have one or the other of these concepts/fields (e.g., may have only the round operation control field 658).

SAE field 656—its content distinguishes whether or not to disable the exception event reporting; when the SAE field's 656 content indicates suppression is enabled, a given instruction does not report any kind of floating-point exception flag and does not raise any floating point exception handler.

Round operation control field 658—its content distinguishes which one of a group of rounding operations to perform (e.g., Round-up, Round-down, Round-towards-zero and Round-to-nearest). Thus, the round operation control field 658 allows for the changing of the rounding mode on a per instruction basis, and thus is particularly useful when this is required. In one embodiment of the invention where a processor includes a control register for specifying rounding modes, the round operation control field's 658 content overrides that register value (Being able to choose the rounding mode without having to perform a save-modify-restore on such a control register is advantageous).

No Memory Access Instruction Templates—Data Transform Type Operation

In the no memory access data transform type operation 615 instruction template, the beta field 654 is interpreted as a data transform field 654B, whose content distinguishes which one of a number of data transforms is to be performed (e.g., no data transform, swizzle, broadcast).

Memory Access Instruction Templates of Class A

In the case of a memory access 620 instruction template of class A, the alpha field 652 is interpreted as an eviction hint field 652B, whose content distinguishes which one of the eviction hints is to be used (in FIG. 6A, temporal 652B.1 and non-temporal 652B.2 are respectively specified for the memory access, temporal 625 instruction template and the memory access, non-temporal 630 instruction template), while the beta field 654 is interpreted as a data manipulation field 654C, whose content distinguishes which one of a number of data manipulation operations (also known as primitives) is to be performed (e.g., no manipulation; broadcast; up conversion of a source; and down conversion of a destination). The memory access 620 instruction templates include the scale field 660, and optionally the displacement field 662A or the displacement scale field 662B.

Vector Memory Instructions perform vector loads from and vector stores to memory, with conversion support. As with regular vector instructions, vector memory instructions transfer data from/to memory in a data element-wise fashion, with the elements that are actually transferred dictated by the contents of the vector mask that is selected as the write mask. In FIG. 6A, rounded corner squares are used to indicate a specific value is present in a field (e.g., memory access 646B for the modifier field 646; temporal 652B.1 and non-temporal 652B.2 for the alpha field 652/eviction hint field 652B).

Memory Access Instruction Templates—Temporal

Temporal data is data likely to be reused soon enough to benefit from caching. This is, however, a hint, and different processors may implement it in different ways, including ignoring the hint entirely.

Memory Access Instruction Templates—Non-Temporal

Non-temporal data is data unlikely to be reused soon enough to benefit from caching in the 1st-level cache and should be given priority for eviction. This is, however, a hint, and different processors may implement it in different ways, including ignoring the hint entirely.

Instruction Templates of Class B

In the case of the instruction templates of class B, the alpha field 652 is interpreted as a write mask control (Z) field 652C, whose content distinguishes whether the write masking controlled by the write mask field 670 should be a merging or a zeroing.

No-Memory Access Instruction Templates of Class B

In the case of the non-memory access 605 instruction templates of class B, part of the beta field 654 is interpreted as an RL field 652A, whose content distinguishes which one of the different augmentation operation types are to be performed (e.g., round 657A.1 and vector length (VSIZE) 657A.2 are respectively specified for the no memory access, write mask control, partial round control type operation 612 instruction template and the no memory access, write mask control, VSIZE type operation 617 instruction template), while the rest of the beta field 654 distinguishes which of the operations of the specified type is to be performed. In FIG. 6, rounded corner blocks are used to indicate a specific value is present (e.g., no memory access 646A in the modifier field 646; round 657A.1 and VSIZE 657A.2 for the RL field 652A). In the no memory access 605 instruction templates, the scale field 660, the displacement field 662A, and the displacement scale filed 662B are not present.

No-Memory Access Instruction Templates—Write Mask Control, Partial Round Control Type Operation

In the no memory access, write mask control, partial round control type operation 610 instruction template, the rest of the beta field 654 is interpreted as a round operation field 659A and exception event reporting is disabled (a given instruction does not report any kind of floating-point exception flag and does not raise any floating point exception handler).

Round operation control field 659A—just as round operation control field 658, its content distinguishes which one of a group of rounding operations to perform (e.g., Round-up, Round-down, Round-towards-zero and Round-to-nearest). Thus, the round operation control field 659A allows for the changing of the rounding mode on a per instruction basis, and thus is particularly useful when this is required. In one embodiment of the invention where a processor includes a control register for specifying rounding modes, the round operation control field's 659A content overrides that register value (Being able to choose the rounding mode without having to perform a save-modify-restore on such a control register is advantageous).

No Memory Access Instruction Templates—Write Mask Control, VSIZE Type Operation

In the no memory access, write mask control, VSIZE type operation 617 instruction template, the rest of the beta field 654 is interpreted as a vector length field 659B, whose content distinguishes which one of a number of data vector length is to be performed on (e.g., 128, 856, or 1012 byte).

Memory Access Instruction Templates of Class B

In the case of a memory access 620 instruction template of class A, part of the beta field 654 is interpreted as a broadcast field 657B, whose content distinguishes whether or not the broadcast type data manipulation operation is to be performed, while the rest of the beta field 654 is interpreted the vector length field 659B. The memory access 620 instruction templates include the scale field 660, and optionally the displacement field 662A or the displacement scale field 662B.

Additional Comments Regarding Fields

With regard to the generic vector friendly instruction format 600, a full opcode field 674 is shown including the format field 640, the base operation field 642, and the data element width field 664. While one embodiment is shown where the full opcode field 674 includes all of these fields, the full opcode field 674 includes less than all of these fields in embodiments that do not support all of them. The full opcode field 674 provides the operation code.

The augmentation operation field 650, the data element width field 664, and the write mask field 670 allow these features to be specified on a per instruction basis in the generic vector friendly instruction format.

The combination of write mask field and data element width field create typed instructions in that they allow the mask to be applied based on different data element widths.

The instruction format requires a relatively small number of bits because it reuses different fields for different purposes based on the contents of other fields. For instance, one perspective is that the modifier field's content choses between the no memory access 605 instructions templates on FIGS. 6A-B and the memory access 620 instruction templates on FIGS. 6Aa-b; while the class field 668's content choses within those non-memory access 605 instruction templates between instruction templates 610/615 of FIGS. 6a and 612/617 of FIG. 6 b; and while the class field 668's content choses within those memory access 620 instruction templates between instruction templates 625/630 of FIGS. 6a and 627 of FIG. 6 b. From another perspective, the class field 668's content choses between the class A and class B instruction templates respectively of FIGS. 6a and b; while the modifier field's content chooses within those class A instruction templates between instruction templates 605 and 620 of FIG. 6A; and while the modifier field's content choses within those class B instruction templates between instruction templates 605 and 620 of FIG. 6 b. In the case of the class field's content indicating a class A instruction template, the content of the modifier field 646 chooses the interpretation of the alpha field 652 (between the rs field 652A and the EH field 652B. In a related manner, the contents of the modifier field 646 and the class field 668 chose whether the alpha field is interpreted as the rs field 652A, the EH field 652B, or the write mask control (Z) field 652C. In the case of the class and modifier fields indicating a class A no memory access operation, the interpretation of the augmentation field's beta field changes based on the rs field's content; while in the case of the class and modifier fields indicating a class B no memory access operation, the interpretation of the beta field depends on the contents of the RL field. In the case of the class and modifier fields indicating a class A memory access operation, the interpretation of the augmentation field's beta field changes based on the base operation field's content; while in the case of the class and modifier fields indicating a class B memory access operation, the interpretation of the augmentation field's beta field's broadcast field 657B changes based on the base operation field's contents. Thus, the combination of the base operation field, modifier field and the augmentation operation field allow for an even wider variety of augmentation operations to be specified.

The various instruction templates found within class A and class B are beneficial in different situations. Class A is useful when zeroing-writemasking or smaller vector lengths are desired for performance reasons. For example, zeroing allows avoiding fake dependences when renaming is used since we no longer need to artificially merge with the destination; as another example, vector length control eases store-load forwarding issues when emulating shorter vector sizes with the vector mask. Class B is useful when it is desirable to: 1) allow floating point exceptions (i.e., when the contents of the SAE field indicate no) while using rounding-mode controls at the same time; 2) be able to use upconversion, swizzling, swap, and/or downconversion; 3) operate on the graphics data type. For instance, upconversion, swizzling, swap, downconversion, and the graphics data type reduce the number of instructions required when working with sources in a different format; as another example, the ability to allow exceptions provides full IEEE compliance with directed rounding-modes.

Exemplary Specific Vector Friendly Instruction Format

FIG. 7 is a block diagram illustrating an exemplary specific vector friendly instruction format according to embodiments of the invention. FIG. 7 shows a specific vector friendly instruction format 700 that is specific in the sense that it specifies the location, size, interpretation, and order of the fields, as well as values for some of those fields. The specific vector friendly instruction format 700 may be used to extend the x86 instruction set, and thus some of the fields are similar or the same as those used in the existing x86 instruction set and extension thereof (e.g., AVX). This format remains consistent with the prefix encoding field, real opcode byte field, MOD R/M field, SIB field, displacement field, and immediate fields of the existing x86 instruction set with extensions. The fields from FIG. 6 into which the fields from FIG. 7 map are illustrated.

It should be understand that although embodiments of the invention are described with reference to the specific vector friendly instruction format 700 in the context of the generic vector friendly instruction format 600 for illustrative purposes, the invention is not limited to the specific vector friendly instruction format 700 except where claimed. For example, the generic vector friendly instruction format 600 contemplates a variety of possible sizes for the various fields, while the specific vector friendly instruction format 700 is shown as having fields of specific sizes. By way of specific example, while the data element width field 664 is illustrated as a one bit field in the specific vector friendly instruction format 700, the invention is not so limited (that is, the generic vector friendly instruction format 600 contemplates other sizes of the data element width field 664).

Format—FIG. 7

The generic vector friendly instruction format 600 includes the following fields listed below in the order illustrated in FIG. 7.

EVEX Prefix (Bytes 0-3)

EVEX Prefix 702—is encoded in a four-byte form.

Format Field 640 (EVEX Byte 0, bits [7:0])—the first byte (EVEX Byte 0) is the format field 640 and it contains 0×62 (the unique value used for distinguishing the vector friendly instruction format in one embodiment of the invention).

The second-fourth bytes (EVEX Bytes 1-3) include a number of bit fields providing specific capability.

REX field 705 (EVEX Byte 1, bits [7-5])—consists of a EVEX.R bit field (EVEX Byte 1, bit [7]—R), EVEX.X bit field (EVEX byte 1, bit [6]—X), and EVEX.B bit field (EVEX byte 1, bit[5]—B). The EVEX.R, EVEX.X, and EVEX.B bit fields provide the same functionality as the corresponding VEX bit fields, and are encoded using is complement form, i.e. ZMMO is encoded as 1111B, ZMM15 is encoded as 0000B. Other fields of the instructions encode the lower three bits of the register indexes as is known in the art (rrr, xxx, and bbb), so that Rrrr, Xxxx, and Bbbb may be formed by adding EVEX.R, EVEX.X, and EVEX.B.

REX′ field 710—this is the first part of the REX′ field 710 and is the EVEX.R′ bit field (EVEX Byte 1, bit [4]—R′) that is used to encode either the upper 16 or lower 16 of the extended 32 register set. In one embodiment of the invention, this bit, along with others as indicated below, is stored in bit inverted format to distinguish (in the well-known x86 32-bit mode) from the BOUND instruction, whose real opcode byte is 62, but does not accept in the MOD R/M field (described below) the value of 11 in the MOD field; alternative embodiments of the invention do not store this and the other indicated bits below in the inverted format. A value of 1 is used to encode the lower 16 registers. In other words, R′Rrrr is formed by combining EVEX.R′, EVEX.R, and the other RRR from other fields.

Opcode map field 715 (EVEX byte 1, bits [3:0]—mmmm)—its content encodes an implied leading opcode byte (0F, 0F 38, or 0F 3).

Data element width field 664 (EVEX byte 2, bit [7]—W)—is represented by the notation EVEX.W. EVEX.W is used to define the granularity (size) of the datatype (either 32-bit data elements or 64-bit data elements).

EVEX.vvvv 720 (EVEX Byte 2, bits [6:3]-vvvv)—the role of EVEX.vvvv may include the following: 1) EVEX.vvvv encodes the first source register operand, specified in inverted (1 s complement) form and is valid for instructions with 2 or more source operands; 2) EVEX.vvvv encodes the destination register operand, specified in 1 s complement form for certain vector shifts; or 3) EVEX.vvvv does not encode any operand, the field is reserved and should contain 1111b. Thus, EVEX.vvvv field 720 encodes the 4 low-order bits of the first source register specifier stored in inverted (1 s complement) form. Depending on the instruction, an extra different EVEX bit field is used to extend the specifier size to 32 registers.

EVEX.0 668 Class field (EVEX byte 2, bit [2]-U)—If EVEX.0 =0, it indicates class A or EVEX.U0; if EVEX.0=1, it indicates class B or EVEX.U1.

Prefix encoding field 725 (EVEX byte 2, bits [1:0]-pp)—provides additional bits for the base operation field. In addition to providing support for the legacy SSE instructions in the EVEX prefix format, this also has the benefit of compacting the SIMD prefix (rather than requiring a byte to express the SIMD prefix, the EVEX prefix requires only 2 bits). In one embodiment, to support legacy SSE instructions that use a SIMD prefix (66H, F2H, F3H) in both the legacy format and in the EVEX prefix format, these legacy SIMD prefixes are encoded into the SIMD prefix encoding field; and at runtime are expanded into the legacy SIMD prefix prior to being provided to the decoder's PLA (so the PLA can execute both the legacy and EVEX format of these legacy instructions without modification). Although newer instructions could use the EVEX prefix encoding field's content directly as an opcode extension, certain embodiments expand in a similar fashion for consistency but allow for different meanings to be specified by these legacy SIMD prefixes. An alternative embodiment may redesign the PLA to support the 2 bit SIMD prefix encodings, and thus not require the expansion.

Alpha field 652 (EVEX byte 3, bit [7]—EH; also known as EVEX.EH, EVEX.rs, EVEX.RL, EVEX.write mask control, and EVEX.N; also illustrated with α)—as previously described, this field is context specific. Additional description is provided later herein.

Beta field 654 (EVEX byte 3, bits [6:4]-SSS, also known as EVEX.s₂₋₀, EVEX.r₂₋₀, EVEX.rr1, EVEX.LL0, EVEX.LLB; also illustrated with βββ)—as previously described, this field is context specific. Additional description is provided later herein.

REX′ field 710—this is the remainder of the REX′ field and is the EVEX.V′ bit field (EVEX Byte 3, bit [3]—V′) that may be used to encode either the upper 16 or lower 16 of the extended 32 register set. This bit is stored in bit inverted format. A value of 1 is used to encode the lower 16 registers. In other words, V′VVVV is formed by combining EVEX.V′, EVEX.vvvv.

Write mask field 670 (EVEX byte 3, bits [2:0]-kkk)—its content specifies the index of a register in the write mask registers as previously described. In one embodiment of the invention, the specific value EVEX kkk=000 has a special behavior implying no write mask is used for the particular instruction (this may be implemented in a variety of ways including the use of a write mask hardwired to all ones or hardware that bypasses the masking hardware).

Real Opcode Field 730 (Byte 4)

This is also known as the opcode byte. Part of the opcode is specified in this field.

MOD R/M Field 740 (Byte 5)

Modifier field 646 (MODR/M.MOD, bits [7-6]—MOD field 742)—As previously described, the MOD field's 742 content distinguishes between memory access and non-memory access operations. This field will be further described later herein.

MODR/M.reg field 744, bits [5-3]—the role of ModR/M.reg field can be summarized to two situations: ModR/M.reg encodes either the destination register operand or a source register operand, or ModR/M.reg is treated as an opcode extension and not used to encode any instruction operand.

MODR/M.r/m field 746, bits [2-0]—The role of ModR/M.r/m field may include the following: ModR/M.r/m encodes the instruction operand that references a memory address, or ModR/M.r/m encodes either the destination register operand or a source register operand.

Scale, Index, Base (SIB) Byte (Byte 6)

Scale field 660 (SIB.SS, bits [7-6]—As previously described, the scale field's 660 content is used for memory address generation. This field will be further described later herein.

SIB.xxx 754 (bits [5-3] and SIB.bbb 756 (bits [2-0])—the contents of these fields have been previously referred to with regard to the register indexes Xxxx and Bbbb.

Displacement Byte(s) (Byte 7 or Bytes 7-10)

Displacement field 662A (Bytes 7-10)—when MOD field 742 contains 10, bytes 7-10 are the displacement field 662A, and it works the same as the legacy 32-bit displacement (disp32) and works at byte granularity.

Displacement factor field 662B (Byte 7)—when MOD field 742 contains 01, byte 7 is the displacement factor field 662B. The location of this field is that same as that of the legacy x86 instruction set 8-bit displacement (disp8), which works at byte granularity. Since disp8 is sign extended, it can only address between -128 and 127 bytes offsets; in terms of 64 byte cache lines, disp8 uses 8 bits that can be set to only four really useful values −128, −64, 0, and 64; since a greater range is often needed, disp32 is used; however, disp32 requires 4 bytes. In contrast to disp8 and disp32, the displacement factor field 662B is a reinterpretation of disp8; when using displacement factor field 662B, the actual displacement is determined by the content of the displacement factor field multiplied by the size of the memory operand access (N). This type of displacement is referred to as disp8*N. This reduces the average instruction length (a single byte of used for the displacement but with a much greater range). Such compressed displacement is based on the assumption that the effective displacement is multiple of the granularity of the memory access, and hence, the redundant low-order bits of the address offset do not need to be encoded. In other words, the displacement factor field 662B substitutes the legacy x86 instruction set 8-bit displacement. Thus, the displacement factor field 662B is encoded the same way as an x86 instruction set 8-bit displacement (so no changes in the ModRM/SIB encoding rules) with the only exception that disp8 is overloaded to disp8*N. In other words, there are no changes in the encoding rules or encoding lengths but only in the interpretation of the displacement value by hardware (which needs to scale the displacement by the size of the memory operand to obtain a byte-wise address offset).

Immediate

Immediate field 672 operates as previously described.

Exemplary Register Architecture—FIG. 8

FIG. 8 is a block diagram of a register architecture 800 according to one embodiment of the invention. The register files and registers of the register architecture are listed below:

Vector register file 810—in the embodiment illustrated, there are 32 vector registers that are 512 bits wide; these registers are referenced as zmm0 through zmm31. The lower order 256 bits of the lower 16 zmm registers are overlaid on registers ymm0-16. The lower order 128 bits of the lower 16 zmm registers (the lower order 128 bits of the ymm registers) are overlaid on registers xmm0-15. The specific vector friendly instruction format 700 operates on these overlaid register file as illustrated in the below tables.

Adjustable Vector Length Class Operations Registers Instruction A (FIG. 6A; 810, 615, zmm registers Templates that U = 0) 625, 630 (the vector length do not include is 64 byte) the vector B (FIG. 6B; 812 zmm registers length field U = 1) (the vector length 659B is 64 byte) Instruction B (FIG. 6B; 817, 627 zmm, ymm, or Templates that U = 1) xmm registers do include the (the vector length vector length is 64 byte, 32 field 659B byte, or 16 byte) depending on the vector length field 659B

In other words, the vector length field 659B selects between a maximum length and one or more other shorter lengths, where each such shorter length is half the length of the preceding length; and instructions templates without the vector length field 659B operate on the maximum vector length. Further, in one embodiment, the class B instruction templates of the specific vector friendly instruction format 700 operate on packed or scalar single/double-precision floating point data and packed or scalar integer data. Scalar operations are operations performed on the lowest order data element position in an zmm/ymm/xmm register; the higher order data element positions are either left the same as they were prior to the instruction or zeroed depending on the embodiment.

Write mask registers 815—in the embodiment illustrated, there are 8 write mask registers (k0 through k7), each 64 bits in size. As previously described, in one embodiment of the invention the vector mask register k0 cannot be used as a write mask; when the encoding that would normally indicate k0 is used for a write mask, it selects a hardwired write mask of 0xFFFF, effectively disabling write masking for that instruction.

Multimedia Extensions Control Status Register (MXCSR) 820—in the embodiment illustrated, this 32-bit register provides status and control bits used in floating-point operations.

General-purpose registers 825—in the embodiment illustrated, there are sixteen 64-bit general-purpose registers that are used along with the existing x86 addressing modes to address memory operands. These registers are referenced by the names RAX, RBX, RCX, RDX, RBP, RSI, RDI, RSP, and R8 through R15.

Extended flags (EFLAGS) register 830—in the embodiment illustrated, this 32 bit register is used to record the results of many instructions.

Floating Point Control Word (FCW) register 835 and Floating Point Status Word (FSW) register 840—in the embodiment illustrated, these registers are used by x87 instruction set extensions to set rounding modes, exception masks and flags in the case of the FCW, and to keep track of exceptions in the case of the FSW.

Scalar floating point stack register file (x87 stack) 845 on which is aliased the MMX packed integer flat register file 850—in the embodiment illustrated, the x87 stack is an eight-element stack used to perform scalar floating-point operations on 32/64/80-bit floating point data using the x87 instruction set extension; while the MMX registers are used to perform operations on 64-bit packed integer data, as well as to hold operands for some operations performed between the MMX and XMM registers.

Segment registers 855—in the illustrated embodiment, there are six 16 bit registers use to store data used for segmented address generation.

RIP register 865—in the illustrated embodiment, this 64 bit register that stores the instruction pointer.

Alternative embodiments of the invention may use wider or narrower registers. Additionally, alternative embodiments of the invention may use more, less, or different register files and registers.

Exemplary In-Order Processor Architecture—FIGS. 9A-9B

FIGS. 9a-b illustrate a block diagram of an exemplary in-order processor architecture. These exemplary embodiments are designed around multiple instantiations of an in-order CPU core that is augmented with a wide vector processor (VPU). Cores communicate through a high-bandwidth interconnect network with some fixed function logic, memory I/O interfaces, and other necessary I/O logic, depending on the e13t application. For example, an implementation of this embodiment as a stand-alone GPU would typically include a PCIe bus.

FIG. 9a is a block diagram of a single CPU core, along with its connection to the on-die interconnect network 902 and with its local subset of the level 2 (L2) cache 904, according to embodiments of the invention. An instruction decoder 900 supports the x86 instruction set with an extension including the specific vector instruction format 700. While in one embodiment of the invention (to simplify the design) a scalar unit 908 and a vector unit 910 use separate register sets (respectively, scalar registers 912 and vector registers 914) and data transferred between them is written to memory and then read back in from a level 1 (L1) cache 906, alternative embodiments of the invention may use a different approach (e.g., use a single register set or include a communication path that allow data to be transferred between the two register files without being written and read back).

The L1 cache 906 allows low-latency accesses to cache memory into the scalar and vector units. Together with load-op instructions in the vector friendly instruction format, this means that the L1 cache 906 can be treated somewhat like an extended register file. This significantly improves the performance of many algorithms, especially with the eviction hint field 652B.

The local subset of the L2 cache 904 is part of a global L2 cache that is divided into separate local subsets, one per CPU core. Each CPU has a direct access path to its own local subset of the L2 cache 904. Data read by a CPU core is stored in its L2 cache subset 904 and can be accessed quickly, in parallel with other CPUs accessing their own local L2 cache subsets. Data written by a CPU core is stored in its own L2 cache subset 904 and is flushed from other subsets, if necessary. The ring network ensures coherency for shared data.

FIG. 9b is an exploded view of part of the CPU core in FIG. 9A according to embodiments of the invention. FIG. 9 b includes an L1 data cache 906A part of the L1 cache 904, as well as more detail regarding the vector unit 910 and the vector registers 914. Specifically, the vector unit 910 is a 16-wide vector processing unit (VPU) (see the 16-wide ALU 928), which executes integer, single-precision float, and double-precision float instructions. The VPU supports swizzling the register inputs with swizzle unit 920, numeric conversion with numeric convert units 922A-B, and replication with replication unit 924 on the memory input. Write mask registers 926 allow predicating the resulting vector writes.

Register data can be swizzled in a variety of ways, e.g. to support matrix multiplication. Data from memory can be replicated across the VPU lanes. This is a common operation in both graphics and non-graphics parallel data processing, which significantly increases the cache efficiency.

The ring network is bi-directional to allow agents such as CPU cores, L2 caches and other logic blocks to communicate with each other within the chip. Each ring data-path is 812-bits wide per direction.

Exemplary Out-of-order Architecture—FIG. 10

FIG. 10 is a block diagram illustrating an exemplary out-of-order architecture according to embodiments of the invention and can be viewed as a more specific description of a pipeline such as the pipeline discussed above in FIG. 1. Specifically, FIG. 10 illustrates a well-known exemplary out-of-order architecture that has been modified to incorporate the vector friendly instruction format and execution thereof. In FIG. 10 arrows denotes a coupling between two or more units and the direction of the arrow indicates a direction of data flow between those units. FIG. 10 includes a front end unit 1005 coupled to an execution engine unit 1010 and a memory unit 1015; the execution engine unit 1010 is further coupled to the memory unit 1015.

The front end unit 1005 includes a level 1 (L1) branch prediction unit 1020 coupled to a level 2 (L2) branch prediction unit 1022. The L1 and L2 brand prediction units 1020 and 1022 are coupled to an L1 instruction cache unit 1024. The L1 instruction cache unit 1024 is coupled to an instruction translation lookaside buffer (TLB) 1026 which is further coupled to an instruction fetch and predecode unit 1028. The instruction fetch and predecode unit 1028 is coupled to an instruction queue unit 1030 which is further coupled a decode unit 1032. The decode unit 1032 comprises a complex decoder unit 1034 and three simple decoder units 1036, 1038, and 1040. The decode unit 1032 includes a micro-code ROM unit 1042. The decode unit 1032 may operate as previously described above in the decode stage section. The L1 instruction cache unit 1024 is further coupled to an L2 cache unit 1048 in the memory unit 1015. The instruction TLB unit 1026 is further coupled to a second level TLB unit 1046 in the memory unit 1015. The decode unit 1032, the micro-code ROM unit 1042, and a loop stream detector unit 1044 are each coupled to a rename/allocator unit 1056 in the execution engine unit 1010.

The execution engine unit 1010 includes the rename/allocator unit 1056 that is coupled to a retirement unit 1074 and a unified scheduler unit 1058. The retirement unit 1074 is further coupled to execution units 1060 and includes a reorder buffer unit 1078. The unified scheduler unit 1058 is further coupled to a physical register files unit 1076 which is coupled to the execution units 1060. The physical register files unit 1076 comprises a vector registers unit 1077A, a write mask registers unit 1077B, and a scalar registers unit 1077C; these register units may provide the vector registers 810, the vector mask registers 815, and the general purpose registers 825; and the physical register files unit 1076 may include additional register files not shown (e.g., the scalar floating point stack register file 845 aliased on the MMX packed integer flat register file 850). The execution units 1060 include three mixed scalar and vector units 1062, 1064, and 1072; a load unit 1066; a store address unit 1068; a store data unit 1070. The load unit 1066, the store address unit 1068, and the store data unit 1070 are each coupled further to a data TLB unit 1052 in the memory unit 1015.

The memory unit 1015 includes the second level TLB unit 1046 which is coupled to the data TLB unit 1052. The data TLB unit 1052 is coupled to an L1 data cache unit 1054. The L1 data cache unit 1054 is further coupled to an L2 cache unit 1048. In some embodiments, the L2 cache unit 1048 is further coupled to L3 and higher cache units 1050 inside and/or outside of the memory unit 1015.

By way of example, the exemplary out-of-order architecture may implement the process pipeline 8200 as follows: 1) the instruction fetch and predecode unit 1028 perform the fetch and length decoding stages; 2) the decode unit 1032 performs the decode stage; 3) the rename/allocator unit 1056 performs the allocation stage and renaming stage; 4) the unified scheduler 1058 performs the schedule stage; 5) the physical register files unit 1076, the reorder buffer unit 1078, and the memory unit 1015 perform the register read/memory read stage; the execution units 1060 perform the execute/data transform stage; 6) the memory unit 1015 and the reorder buffer unit 1078 perform the write back/memory write stage 1960; 7) the retirement unit 1074 performs the ROB read stage; 8) various units may be involved in the exception handling stage; and 9) the retirement unit 1074 and the physical register files unit 1076 perform the commit stage.

Exemplary Single Core and Multicore Processors—FIG. 15

FIG. 15 is a block diagram of a single core processor and a multicore processor 1500 with integrated memory controller and graphics according to embodiments of the invention. The solid lined boxes in FIG. 15 illustrate a processor 1500 with a single core 1502A, a system agent 1510, a set of one or more bus controller units 1516, while the optional addition of the dashed lined boxes illustrates an alternative processor 1500 with multiple cores 1502A-N, a set of one or more integrated memory controller unit(s) 1514 in the system agent unit 1510, and an integrated graphics logic 1508.

The memory hierarchy includes one or more levels of cache within the cores, a set or one or more shared cache units 1506, and external memory (not shown) coupled to the set of integrated memory controller units 1514. The set of shared cache units 1506 may include one or more mid-level caches, such as level 2 (L2), level 3 (L3), level 4 (L4), or other levels of cache, a last level cache (LLC), and/or combinations thereof. While in one embodiment a ring based interconnect unit 1512 interconnects the integrated graphics logic 1508, the set of shared cache units 1506, and the system agent unit 1510, alternative embodiments may use any number of well-known techniques for interconnecting such units.

In some embodiments, one or more of the cores 1502A-N are capable of multi-threading. The system agent 1510 includes those components coordinating and operating cores 1502A-N. The system agent unit 1510 may include for example a power control unit (PCU) and a display unit. The PCU may be or include logic and components needed for regulating the power state of the cores 1502A-N and the integrated graphics logic 1508. The display unit is for driving one or more externally connected displays.

The cores 1502A-N may be homogenous or heterogeneous in terms of architecture and/or instruction set. For example, some of the cores 1502A-N may be in order (e.g., like that shown in FIGS. 9A and 9B) while others are out-of-order (e.g., like that shown in FIG. 10). As another example, two or more of the cores 1502A-N may be capable of executing the same instruction set, while others may be capable of executing only a subset of that instruction set or a different instruction set. At least one of the cores is capable of executing the vector friendly instruction format described herein.

The processor may be a general-purpose processor, such as a Core™ i3, i5, i7, 2 Duo and Quad, Xeon™, or Itanium™ processor, which are available from Intel Corporation, of Santa Clara, Calif. Alternatively, the processor may be from another company. The processor may be a special-purpose processor, such as, for example, a network or communication processor, compression engine, graphics processor, co-processor, embedded processor, or the like. The processor may be implemented on one or more chips. The processor 1500 may be a part of and/or may be implemented on one or more substrates using any of a number of process technologies, such as, for example, BiCMOS, CMOS, or NMOS.

Exemplary Computer Systems and Processors—FIGS. 11-13

FIGS. 11-13 are exemplary systems suitable for including the processor 1500, while FIG. 15 is an exemplary system on a chip (SoC) that may include one or more of the cores 1502. Other system designs and configurations known in the arts for laptops, desktops, handheld PCs, personal digital assistants, engineering workstations, servers, network devices, network hubs, switches, embedded processors, digital signal processors (DSPs), graphics devices, video game devices, set-top boxes, micro controllers, cell phones, portable media players, hand held devices, and various other electronic devices, are also suitable. In general, a huge variety of systems or electronic devices capable of incorporating a processor and/or other execution logic as disclosed herein are generally suitable.

Referring now to FIG. 11, shown is a block diagram of a system 1100 in accordance with one embodiment of the invention. The system 1100 may include one or more processors 1110, 1115, which are coupled to graphics memory controller hub (GMCH) 1120. The optional nature of additional processors 1115 is denoted in FIG. 11 with broken lines.

Each processor 1110, 1115 may be some version of processor 1500. However, it should be noted that it is unlikely that integrated graphics logic and integrated memory control units would exist in the processors 1110, 1115.

FIG. 11 illustrates that the GMCH 1120 may be coupled to a memory 1140 that may be, for example, a dynamic random access memory (DRAM). The DRAM may, for at least one embodiment, be associated with a non-volatile cache.

The GMCH 1120 may be a chipset, or a portion of a chipset. The GMCH 1120 may communicate with the processor(s) 1110, 1115 and control interaction between the processor(s) 1110, 1115 and memory 1140. The GMCH 1120 may also act as an accelerated bus interface between the processor(s) 1110, 1115 and other elements of the system 1100. For at least one embodiment, the GMCH 1120 communicates with the processor(s) 1110, 1115 via a multi-drop bus, such as a frontside bus (FSB) 1195.

Furthermore, GMCH 1120 is coupled to a display 1145 (such as a flat panel display). GMCH 1120 may include an integrated graphics accelerator. GMCH 1120 is further coupled to an input/output (I/O) controller hub (ICH) 1150, which may be used to couple various peripheral devices to system 1100. Shown for example in the embodiment of FIG. 11 is an external graphics device 1160, which may be a discrete graphics device coupled to ICH 1150, along with another peripheral device 1170.

Alternatively, additional or different processors may also be present in the system 1100. For example, additional processor(s) 1115 may include additional processors(s) that are the same as processor 1110, additional processor(s) that are heterogeneous or asymmetric to processor 1110, accelerators (such as, e.g., graphics accelerators or digital signal processing (DSP) units), field programmable gate arrays, or any other processor. There can be a variety of differences between the physical resources 1110, 1115 in terms of a spectrum of metrics of merit including architectural, microarchitectural, thermal, power consumption characteristics, and the like. These differences may effectively manifest themselves as asymmetry and heterogeneity amongst the processing elements 1110, 1115. For at least one embodiment, the various processing elements 1110, 1115 may reside in the same die package.

Referring now to FIG. 12, shown is a block diagram of a second system 1200 in accordance with an embodiment of the present invention. As shown in FIG. 12, multiprocessor system 1200 is a point-to-point interconnect system, and includes a first processor 1270 and a second processor 1280 coupled via a point-to-point interconnect 1250. As shown in FIG. 12, each of processors 1270 and 1280 may be some version of the processor 1500.

Alternatively, one or more of processors 1270, 1280 may be an element other than a processor, such as an accelerator or a field programmable gate array.

While shown with only two processors 1270, 1280, it is to be understood that the scope of the present invention is not so limited. In other embodiments, one or more additional processing elements may be present in a given processor.

Processor 1270 may further include an integrated memory controller hub (IMC) 1272 and point-to-point (P-P) interfaces 1276 and 1278. Similarly, second processor 1280 may include a IMC 1282 and P-P interfaces 1286 and 1288. Processors 1270, 1280 may exchange data via a point-to-point (PtP) interface 1250 using PtP interface circuits 1278, 1288. As shown in FIG. 12, IMC's 1272 and 1282 couple the processors to respective memories, namely a memory 1242 and a memory 1244, which may be portions of main memory locally attached to the respective processors.

Processors 1270, 1280 may each exchange data with a chipset 1290 via individual P-P interfaces 1252, 1254 using point to point interface circuits 1276, 1294, 1286, 1298. Chipset 1290 may also exchange data with a high-performance graphics circuit 1238 via a high-performance graphics interface 1239.

A shared cache (not shown) may be included in either processor outside of both processors, yet connected with the processors via P-P interconnect, such that either or both processors' local cache information may be stored in the shared cache if a processor is placed into a low power mode.

Chipset 1290 may be coupled to a first bus 1216 via an interface 1296. In one embodiment, first bus 1216 may be a Peripheral Component Interconnect (PCI) bus, or a bus such as a PCI Express bus or another third generation I/O interconnect bus, although the scope of the present invention is not so limited.

As shown in FIG. 12, various I/O devices 1214 may be coupled to first bus 1216, along with a bus bridge 1218 which couples first bus 1216 to a second bus 1220. In one embodiment, second bus 1220 may be a low pin count (LPC) bus. Various devices may be coupled to second bus 1220 including, for example, a keyboard/mouse 1222, communication devices 1226 and a data storage unit 1228 such as a disk drive or other mass storage device which may include code 1230, in one embodiment. Further, an audio I/O 1224 may be coupled to second bus 1220. Note that other architectures are possible. For example, instead of the point-to-point architecture of FIG. 12, a system may implement a multi-drop bus or other such architecture.

Referring now to FIG. 13, shown is a block diagram of a third system 1300 in accordance with an embodiment of the present invention. Like elements in FIGS. 12 and 13 bear like reference numerals, and certain aspects of FIG. 12 have been omitted from FIG. 13 in order to avoid obscuring other aspects of FIG. 13.

FIG. 13 illustrates that the processing elements 1270, 1280 may include integrated memory and I/O control logic (“CL”) 1272 and 1282, respectively. For at least one embodiment, the CL 1272, 1282 may include memory controller hub logic (IMC) such as that described above in connection with FIGS. 11 and 12. In addition. CL 1272, 1282 may also include I/O control logic. FIG. 13 illustrates that not only are the memories 1242, 1244 coupled to the CL 1272, 1282, but also that I/O devices 1314 are also coupled to the control logic 1272, 1282. Legacy I/O devices 1315 are coupled to the chipset 1290.

Referring now to FIG. 14, shown is a block diagram of a SoC 1400 in accordance with an embodiment of the present invention. Similar elements in FIG. 15 bear like reference numerals. Also, dashed lined boxes are optional features on more advanced SoCs. In FIG. 14, an interconnect unit(s) 1402 is coupled to: an application processor 1410 which includes a set of one or more cores 1502A-N and shared cache unit(s) 1506; a system agent unit 1510; a bus controller unit(s) 1516; an integrated memory controller unit(s) 1514; a set or one or more media processors 1420 which may include integrated graphics logic 1508, an image processor 1424 for providing still and/or video camera functionality, an audio processor 1426 for providing hardware audio acceleration, and a video processor 1428 for providing video encode/decode acceleration; an static random access memory (SRAM) unit 1430; a direct memory access (DMA) unit 1432; and a display unit 1440 for coupling to one or more external displays.

Embodiments of the mechanisms disclosed herein may be implemented in hardware, software, firmware, or a combination of such implementation approaches. Embodiments of the invention may be implemented as computer programs or program code executing on programmable systems comprising at least one processor, a storage system (including volatile and non-volatile memory and/or storage elements), at least one input device, and at least one output device.

Program code may be applied to input data to perform the functions described herein and generate output information. The output information may be applied to one or more output devices, in known fashion. For purposes of this application, a processing system includes any system that has a processor, such as, for example; a digital signal processor (DSP), a microcontroller, an application specific integrated circuit (ASIC), or a microprocessor.

The program code may be implemented in a high level procedural or object oriented programming language to communicate with a processing system. The program code may also be implemented in assembly or machine language, if desired. In fact, the mechanisms described herein are not limited in scope to any particular programming language. In any case, the language may be a compiled or interpreted language.

One or more aspects of at least one embodiment may be implemented by representative instructions stored on a machine-readable medium which represents various logic within the processor, which when read by a machine causes the machine to fabricate logic to perform the techniques described herein. Such representations, known as “IP cores” may be stored on a tangible, machine readable medium and supplied to various customers or manufacturing facilities to load into the fabrication machines that actually make the logic or processor.

Such machine-readable storage media may include, without limitation, non-transitory, tangible arrangements of articles manufactured or formed by a machine or device, including storage media such as hard disks, any other type of disk including floppy disks, optical disks (compact disk read-only memories (CD-ROMs), compact disk rewritables (CD-RWs)), and magneto-optical disks, semiconductor devices such as read-only memories (ROMs), random access memories (RAMs) such as dynamic random access memories (DRAMs), static random access memories (SRAMs), erasable programmable read-only memories (EPROMs), flash memories, electrically erasable programmable read-only memories (EEPROMs), magnetic or optical cards, or any other type of media suitable for storing electronic instructions.

Accordingly, embodiments of the invention also include non-transitory, tangible machine-readable media containing instructions the vector friendly instruction format or containing design data, such as Hardware Description Language (HDL), which defines structures, circuits, apparatuses, processors and/or system features described herein. Such embodiments may also be referred to as program products.

In some cases, an instruction converter may be used to convert an instruction from a source instruction set to a target instruction set. For example, the instruction converter may translate (e.g., using static binary translation, dynamic binary translation including dynamic compilation), morph, emulate, or otherwise convert an instruction to one or more other instructions to be processed by the core. The instruction converter may be implemented in software, hardware, firmware, or a combination thereof. The instruction converter may be on processor, off processor, or part on and part off processor.

FIG. 16 is a block diagram contrasting the use of a software instruction converter to convert binary instructions in a source instruction set to binary instructions in a target instruction set according to embodiments of the invention. In the illustrated embodiment, the instruction converter is a software instruction converter, although alternatively the instruction converter may be implemented in software, firmware, hardware, or various combinations thereof. FIG. 16 shows a program in a high level language 1602 may be compiled using an x86 compiler 1604 to generate x86 binary code 1606 that may be natively executed by a processor with at least one x86 instruction set core 1616 (it is assume that some of the instructions that were compiled are in the vector friendly instruction format). The processor with at least one x86 instruction set core 1616 represents any processor that can perform substantially the same functions as a Intel processor with at least one x86 instruction set core by compatibly executing or otherwise processing (1) a substantial portion of the instruction set of the Intel x86 instruction set core or (2) object code versions of applications or other software targeted to run on an Intel processor with at least one x86 instruction set core, in order to achieve substantially the same result as an Intel processor with at least one x86 instruction set core. The x86 compiler 1604 represents a compiler that is operable to generate x86 binary code 1606 (e.g., object code) that can, with or without additional linkage processing, be executed on the processor with at least one x86 instruction set core 1616. Similarly, FIG. 16 shows the program in the high level language 1602 may be compiled using an alternative instruction set compiler 1608 to generate alternative instruction set binary code 1610 that may be natively executed by a processor without at least one x86 instruction set core 1614 (e.g., a processor with cores that execute the MIPS instruction set of MIPS Technologies of Sunnyvale, Calif. and/or that execute the ARM instruction set of ARM Holdings of Sunnyvale, Calif.). The instruction converter 1612 is used to convert the x86 binary code 1606 into code that may be natively executed by the processor without an x86 instruction set core 1614. This converted code is not likely to be the same as the alternative instruction set binary code 1610 because an instruction converter capable of this is difficult to make; however, the converted code will accomplish the general operation and be made up of instructions from the alternative instruction set. Thus, the instruction converter 1612 represents software, firmware, hardware, or a combination thereof that, through emulation, simulation or any other process, allows a processor or other electronic device that does not have an x86 instruction set processor or core to execute the x86 binary code 1606.

Certain operations of the instruction(s) in the vector friendly instruction format disclosed herein may be performed by hardware components and may be embodied in machine-executable instructions that are used to cause, or at least result in, a circuit or other hardware component programmed with the instructions performing the operations. The circuit may include a general-purpose or special-purpose processor, or logic circuit, to name just a few examples. The operations may also optionally be performed by a combination of hardware and software. Execution logic and/or a processor may include specific or particular circuitry or other logic responsive to a machine instruction or one or more control signals derived from the machine instruction to store an instruction specified result operand. For example, embodiments of the instruction(s) disclosed herein may be executed in one or more the systems of FIGS. 11-16 and embodiments of the instruction(s) in the vector friendly instruction format may be stored in program code to be executed in the systems. Additionally, the processing elements of these figures may utilize one of the detailed pipelines and/or architectures (e.g., the in-order and out-of-order architectures) detailed herein. For example, the decode unit of the in-order architecture may decode the instruction(s), pass the decoded instruction to a vector or scalar unit, etc.

The above description is intended to illustrate preferred embodiments of the present invention. From the discussion above it should also be apparent that especially in such an area of technology, where growth is fast and further advancements are not easily foreseen, the invention can may be modified in arrangement and detail by those skilled in the art without departing from the principles of the present invention within the scope of the accompanying claims and their equivalents. For example, one or more operations of a method may be combined or further broken apart.

Alternative Embodiments

While embodiments have been described which would natively execute the vector friendly instruction format, alternative embodiments of the invention may execute the vector friendly instruction format through an emulation layer running on a processor that executes a different instruction set (e.g., a processor that executes the MIPS instruction set of MIPS Technologies of Sunnyvale, Calif., a processor that executes the ARM instruction set of ARM Holdings of Sunnyvale, Calif.). Also, while the flow diagrams in the figures show a particular order of operations performed by certain embodiments of the invention, it should be understood that such order is exemplary (e.g., alternative embodiments may perform the operations in a different order, combine certain operations, overlap certain operations, etc.).

In the description above, for the purposes of explanation, numerous specific details have been set forth in order to provide a thorough understanding of the embodiments of the invention. It will be apparent however, to one skilled in the art, that one or more other embodiments may be practiced without some of these specific details. The particular embodiments described are not provided to limit the invention but to illustrate embodiments of the invention. The scope of the invention is not to be determined by the specific examples provided above but only by the claims below. 

What is claimed is:
 1. A processor comprising: decoder to decode an instruction comprising input operands of a conditional vector with elements that indicate whether a condition of a loop is either true or not true for each respective iteration of the loop, a base value, and a stride; and an execution unit to execute the instruction to provide a resultant output vector, the execution unit to produce an element in each element position of the resultant output vector by decrementing the base value by the stride each time the condition is true in a corresponding element position of the conditional vector.
 2. The processor of claim 1 wherein each corresponding element position of the conditional vector is a same element position of the resultant output vector.
 3. The processor of claim 1 wherein each corresponding element position of the conditional vector is an immediately preceding element position of the resultant output vector.
 4. The processor of claim 1 wherein the base value and the stride are immediate scalar operands.
 5. The processor of claim 1 wherein the base value and the stride are each vector operands.
 6. The processor of claim 1 wherein the instruction processes multiple elements of the resultant output vector simultaneously in parallel.
 7. The processor of claim 1 wherein the instruction processes multiple elements of the resultant output vector serially.
 8. The processor of claim 1 wherein, for a first element position of the resultant output vector, a value is the base value.
 9. The processor of claim 8 wherein the base value is a carry over from a preceding execution of the instruction.
 10. The processor of claim 8 wherein, for an element position of the resultant output vector other than the first element position of the resultant output vector, the value is a value from an immediately preceding resultant output vector element.
 11. A method comprising: decoding an instruction comprising input operands of a conditional vector with elements that indicate whether a condition of a loop is either true or not true for each respective iteration of the loop, a base value, and a stride; and executing the instruction to provide a resultant output vector by producing an element in each element position of the resultant output vector by decrementing the base value by the stride each time the condition is true in a corresponding element position of the conditional vector.
 12. The method of claim 11 wherein each corresponding element position of the conditional vector is a same element position of the resultant output vector.
 13. The method of claim 11 wherein each corresponding element position of the conditional vector is an immediately preceding element position of the resultant output vector.
 14. The method of claim 11 wherein the base value and the stride are immediate scalar operands.
 15. The method of claim 11 wherein the base value and the stride are each vector operands.
 16. A computing system comprising: a system memory; and a processor coupled to the system memory, the processor comprising: decoder to decode an instruction comprising input operands of a conditional vector with elements that indicate whether a condition of a loop is either true or not true for each respective iteration of the loop, a base value, and a stride, and an execution unit to execute the instruction to provide a resultant output vector, the execution unit to produce an element in each element position of the resultant output vector by decrementing the base value by the stride each time the condition is true in a corresponding element position of the conditional vector.
 17. The computing system of claim 16 wherein each corresponding element position of the conditional vector is a same element position of the resultant output vector.
 18. The computing system of claim 16 wherein each corresponding element position of the conditional vector is an immediately preceding element position of the resultant output vector.
 19. The computing system of claim 16 wherein a base value and the stride are immediate scalar operands.
 20. The computing system of claim 16 wherein the base value and the stride are each vector operands.
 21. A non-transitory machine readable medium that stores code that when executed by a machine causes the machine to perform a method comprising: decoding an instruction comprising input operands of a conditional vector with elements that indicate whether a condition of a loop is either true or not true for each respective iteration of the loop, a base value, and a stride; and executing the instruction to provide a resultant output vector by producing an element in each element position of the resultant output vector by one of incrementing and decrementing the base value by the stride each time the condition is true in a corresponding element position of the conditional vector.
 22. The non-transitory machine readable medium of claim 21, wherein each corresponding element position of the conditional vector is a same element position of the resultant output vector.
 23. The non-transitory machine readable medium of claim 21, wherein each corresponding element position of the conditional vector is an immediately preceding element position of the resultant output vector.
 24. The non-transitory machine readable medium of claim 21, wherein the base value and the stride are immediate scalar operands.
 25. The non-transitory machine readable medium of claim 21, wherein the base value and the stride are each vector operands. 